Close

1. Identity statement
Reference TypeConference Paper (Conference Proceedings)
Sitesibgrapi.sid.inpe.br
Holder Codeibi 8JMKD3MGPEW34M/46T9EHH
Identifier6qtX3pFwXQZG2LgkFdY/UMQEE
Repositorysid.inpe.br/sibgrapi@80/2008/07.17.22.39
Last Update2008:07.17.22.39.46 (UTC) administrator
Metadata Repositorysid.inpe.br/sibgrapi@80/2008/07.17.22.39.48
Metadata Last Update2022:06.14.00.13.44 (UTC) administrator
DOI10.1109/SIBGRAPI.2008.7
Citation KeyLageBoPeVeTaLeLo:2008:ApSmTr
TitleApproximations by Smooth Transitions in Binary Space Partitions
FormatPrinted, On-line.
Year2008
Access Date2024, Apr. 28
Number of Files1
Size2465 KiB
2. Context
Author1 Lage, Marcos
2 Bordignon, Alex
3 Petronetto, Fabiano
4 Veiga, Alvaro
5 Tavares, Geovan
6 Lewiner, Thomas
7 Lopes, Hélio
Affiliation1 Department of Mathematics, PUC–Rio de Janeiro, Brazil
2 Department of Mathematics, PUC–Rio de Janeiro, Brazil
3 Department of Mathematics, PUC–Rio de Janeiro, Brazil
4 Department of Electrical Engineering, PUC–Rio de Janeiro, Brazil
5 Department of Mathematics, PUC–Rio de Janeiro, Brazil
6 Department of Mathematics, PUC–Rio de Janeiro, Brazil
7 Department of Mathematics, PUC–Rio de Janeiro, Brazil
EditorJung, Cláudio Rosito
Walter, Marcelo
Conference NameBrazilian Symposium on Computer Graphics and Image Processing, 21 (SIBGRAPI)
Conference LocationCampo Grande, MS, Brazil
Date12-15 Oct. 2008
PublisherIEEE Computer Society
Publisher CityLos Alamitos
Book TitleProceedings
Tertiary TypeFull Paper
History (UTC)2008-07-17 22:39:48 :: tomlew@mat.puc-rio.br -> administrator ::
2009-08-13 20:38:54 :: administrator -> tomlew@mat.puc-rio.br ::
2010-08-28 20:03:22 :: tomlew@mat.puc-rio.br -> administrator ::
2022-06-14 00:13:44 :: administrator -> :: 2008
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Version Typefinaldraft
KeywordsBinary Space Partitions
Smooth Transition Regression Trees
Classification and Regression Tree
AbstractThis work proposes a simple approximation scheme for discrete data that leads to an infinitely smooth result without global optimization. It combines the flexibility of Binary Space Partitions Trees with the statistical robustness of Smooth Transition Regression Trees. The construction of the tree is straightforward and easily controllable, using error-driven metrics or external constraints. Moreover, it leads to a concise representation. Applications on synthetic and real data, both scalar and vector-valued demonstrated the effectiveness of this approach.
Arrangement 1urlib.net > SDLA > Fonds > SIBGRAPI 2008 > Approximations by Smooth...
Arrangement 2urlib.net > SDLA > Fonds > Full Index > Approximations by Smooth...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Contentthere are no files
4. Conditions of access and use
data URLhttp://urlib.net/ibi/6qtX3pFwXQZG2LgkFdY/UMQEE
zipped data URLhttp://urlib.net/zip/6qtX3pFwXQZG2LgkFdY/UMQEE
Languageen
Target Filelewiner-bsp.pdf
User Grouptomlew@mat.puc-rio.br
administrator
Visibilityshown
5. Allied materials
Mirror Repositorysid.inpe.br/banon/2001/03.30.15.38.24
Next Higher Units8JMKD3MGPEW34M/46SG4TH
8JMKD3MGPEW34M/4742MCS
Citing Item Listsid.inpe.br/sibgrapi/2022/05.14.04.55 3
Host Collectionsid.inpe.br/banon/2001/03.30.15.38
6. Notes
Empty Fieldsarchivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination documentstage e-mailaddress edition electronicmailaddress group isbn issn label lineage mark nextedition notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url volume


Close